LR-LRU: A PACS-Oriented Intelligent Cache Replacement Policy
نویسندگان
چکیده
منابع مشابه
LRU-based Algorithms for Web Cache Replacement
Caching has been introduced and applied in prototype and commercial Web-based information systems in order to reduce the overall bandwidth and increase system’s fault tolerance. This paper presents a track of Web cache replacement algorithms based on the Least Recently Used (LRU) idea. We propose an extension to the conventional LRU algorithm by considering the number of references to Web objec...
متن کاملA Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy
The recent advancement in the field of distributed computing depicts a need of developing highly associative and less expensive cache memories for the state-of-art processors i.e., Intel Core i6, i7, etc. Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. Most of the conventional ...
متن کاملLS-LRU: A Lazy-Split LRU Buffer Replacement Policy for Flash-Based B+-tree Index
Most embedded systems are equipped with flash memory owing to its shock resistance, fast access, and low power consumption. However, some of its distinguishing characteristics, including out-of-place updates, an asymmetric read/write/erase speed, and a limited number of write/erase cycles, make it necessary to reconsider the existing system designs to explore its performance potential. For exam...
متن کاملA Cache - Partitioned Hash Table with LRU
In this thesis we introduce CPHASH a scalable fixed size hash table that supports eviction using an LRU list, and CPSERVER a scalable in memory key/value cache server that uses CPHASH to implement its hash table. CPHASH uses computation migration to avoid transferring data between cores. Experiments on a 48 core machine show that CPHASH has 2 to 3 times higher throughput than a hash table imple...
متن کاملThe Commonly Used Lru Replacement Policy Causes Thrashing for Memory- Intensive Workloads. a Simple Mechanism That Dynamically Changes the Insertion Policy Used by Lru Replacement Reduces Cache Misses by 21 Percent and Requires a Total Storage Overhead of Less Than
......One of the major limiters of computer system performance has been the access to main memory, which is typically two orders of magnitude slower than the processor. To bridge this gap, modern processors already devote more than half the on-chip transistors to the last-level cache (in our studies, the L2 cache). These designs typically use the least-recently-used (LRU) replacement policy, or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2913961